Quantifying Competitiveness in Paging with Locality of Reference
نویسندگان
چکیده
منابع مشابه
Truly Online Paging with Locality of Reference
The competitive analysis fails to model locality of reference in the online paging problem. To deal with it, Borodin et al. introduced the access graph model, which attempts to capture the locality of reference. However, the access graph model has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access gr...
متن کاملOn Certain New Models for Paging with Locality of Reference
The competitive ratio is the most common metric in online algorithm analysis. Unfortunately, it produces pessimistic measures and often fails to distinguish between paging algorithms that have vastly differing performance in practice. An apparent reason for this is that the model does not take into account the locality of reference evidenced by actual input sequences. Therefore many alternative...
متن کاملThe Competitiveness of on - Line Demand Paging
We investigate the performance ofon-line demand paging algorithms (in comparison with the optimal off-line demand paging algorithms) for generalized two level memo ries, which are two level memories whose second level is composed of different speed memories. We consider and model variants of this problem which are of practical inter est. We especially investigate LRU and FIFO, which are both ...
متن کاملList Update with Locality of Reference
It is known that in practice, request sequences for the list update problem exhibit a certain degree of locality of reference. Motivated by this observation we apply the locality of reference model for the paging problem due to Albers et al. [STOC 2002/JCSS 2005] in conjunction with bijective analysis [SODA 2007] to list update. Using this framework, we prove that Move-to-Front (MTF) is the uni...
متن کاملOn List Update with Locality of Reference
We present a comprehensive study of the list update problem with locality of reference. More specifically, we present a combined theoretical and experimental study in which the theoretically proven and experimentally observed performance guarantees of algorithms match or nearly match. In the first part of the paper we introduce a new model of locality of reference that is based on the natural c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0406-9